Bisimulation in Untyped Lambda Calculus:
نویسندگان
چکیده
منابع مشابه
Gödelization in the Untyped lambda-Calculus
It is well-known that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if two terms are beta-equivalent, even if they both have normal forms. This implies that it is impossible in the pure untyped lambda calculus to do Godelisation, i.e. to write a function that can convert a term to a representation of (the normal form of) that term, as equi...
متن کاملA bisimulation-like proof method for contextual properties in untyped lambda-calculus with references and deallocation
We develop a general method of proving properties of programs under arbitrary contexts—including (but not limited to) observational equivalence, space improvement, and a form of memory safety of the programs—in untyped call-byvalue λ-calculus with first-class, dynamically allocated, higher-order references and deallocation. The method generalizes Sumii et al.’s environmental bisimulation techni...
متن کاملInnocent game models of untyped lambda-calculus
This thesis is a detailed examination of the application of game semantics to constructing denotational models of the pure untyped λ-calculus. Game semantics is a fairly recent technique, using a formal setting for interaction to model sequential programming languages in an accurate way. We use a modification of the “innocent” games first used to give a fully-abstract syntax-independent model o...
متن کاملUntyped Lambda-Calculus with Input-Output
We introduce an untyped-calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classiication of possibly innnite input-output behaviors, such as those required for servers or distributed systems. We deene two terms to be operationally approximate ii they have similar behaviors in any context. We then deene a notion of app...
متن کاملExtensional Models of Untyped Lambda-mu Calculus
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called the stream combinatory algebra, which is an extension of the combinatory algebra, and it is proved that the extensional equality of the Lambda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80083-5